Dynamic Bloom Filters: Analysis and usability

Bloom Filters (BF) [1] are space-e cient datastructures that allow membership queries from a set. In most recent years they have gained great momentum and various tweaks to them have been proposed to achieve speci c goals. Dynamic Bloom Filters (DBF) have been proposed [2] as a method to implement Bloom Filters in a scalable environment, i.e. where the nal size of a dataset is not known in advance. In this project we will look at BF and DBF and walk through the analysis of the two. We will also run simulations to show that the results of the analysis is practically achievable. We will also evaluate the performance of DBF and try to answer the question of if it is in fact practical to use in any situation.